On Group Rings and some of their Applications to Combinatorics and Cryptography
نویسندگان
چکیده
We give a survey of recent applications of group rings to combinatorics and to cryptography, including their use in the differential cryptanalysis of block ciphers.
منابع مشابه
Some results on the complement of a new graph associated to a commutative ring
The rings considered in this article are commutative with identity which are not fields. Let R be a ring. A. Alilou, J. Amjadi and Sheikholeslami introduced and investigated a graph whose vertex set is the set of all nontrivial ideals of R and distinct vertices I, J are joined by an edge in this graph if and only if either ann(I)J = (0) or ann(J)I = (0). They called this graph as a new graph as...
متن کاملINDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS
Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$, if no two vertices of $S$ are adjacent.The independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.
متن کاملAdditive Combinatorics: With a View Towards Computer Science and Cryptography - An Exposition
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define – perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which are used there. One might say that additive combinatorics is a branch of mathematics concerning the study of additive structures in sets equipped with a grou...
متن کاملAn Introduction to Differential Computation Analysis (DCA) on the withe-box cryptography algorithms
Advances in information and communication technologies lead to use of some new devices such as smart phones. The new devices provide more advantages for the adversaries hence with respect to them, one can define with-box cryptography. In this new model of cryptography, designers try to hide the key using as a kind of implementation. The Differential Computation Analysis (DCA) is a side channel ...
متن کاملOn $\mathbb{Z}G$-clean rings
Let $R$ be an associative ring with unity. An element $x \in R$ is called $\mathbb{Z}G$-clean if $x=e+r$, where $e$ is an idempotent and $r$ is a $\mathbb{Z}G$-regular element in $R$. A ring $R$ is called $\mathbb{Z}G$-clean if every element of $R$ is $\mathbb{Z}G$-clean. In this paper, we show that in an abelian $\mathbb{Z}G$-regular ring $R$, the $Nil(R)$ is a two-sided ideal of $R$ and $\fra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014